Planar graphs have bounded nonrepetitive chromatic number
نویسندگان
چکیده
منابع مشابه
The locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملOn the b-chromatic number of regular bounded graphs
A b-coloring of a graph is a proper coloring such that every color class contains a vertex adjacent to at least one vertex in each of the other color classes. The b-chromatic number of a graph G, denoted by b(G), is the maximum integer k such that G admits a b-coloring with k colors. El Sahili and Kouider conjectured that b(G) = d + 1 for d-regular graph with girth 5, d ≥ 4. In this paper, we p...
متن کاملNonrepetitive Colourings of Graphs Excluding a Fixed Immersion or Topological Minor
We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More generally, we prove that if H is a fixed planar graph that has a planar embedding with all the vertices with degree at least 4 on a single face, then graphs excluding H as a topological minor have bounded nonrepetitive chromatic number. This is the largest class of graphs known to have bounded non...
متن کاملThe chromatic number of the square of subcubic planar graphs
Wegner conjectured in 1977 that the square of every planar graph with maximum degree at most 3 is 7-colorable. We prove this conjecture using the discharging method and computational techniques to verify reducible configurations. Mathematics Subject Classification: Primary 05C15; Secondary 05C10, 68R10.
متن کاملStrong Oriented Chromatic Number of Planar Graphs without Short Cycles
Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mapping φ from V (G) to M such that φ(u) 6= φ(v) whenever −→uv is an arc in G and φ(v)−φ(u) 6= −(φ(t)−φ(z)) whenever −→uv and zt are two arcs in G. The strong oriented chromatic number of an oriented graph is the minimal order of a group M such that G has an M-strong-oriented coloring. This notion was ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Combinatorics
سال: 2020
ISSN: 2517-5599
DOI: 10.19086/aic.12100